Technical Report 2008 - 002 Operational Semantics for a Concurrent
نویسندگان
چکیده
We investigate the possibility of constructing a fully compositional concurrent process algebra (dubbed Communicating Visibly pushdown Processes or CVP for short) based on visibly pushdown automata. CVP is a superset of CSP, thus combining all the good properties of finite-state algebrae with context-free features. In particular, CVP includes support for parallel composition (which has however a restricted semantics by necessity). In addition, CVP supports self-embedding recursion, stack analysis, the specification of preand post-conditions, and the analysis of internal properties of a module. CVP lays the basis of algebraic software verification for infinite-state processes such as application software.
منابع مشابه
Operational GSPN Semantics of MPA
In this technical report we define an operational net semantics for the stochastic process algebra MPA based on generalized stochastic Petri nets. As a consequence of the definition of such a semantics, we present an interesting modeling technique for concurrent systems which is based on MPA. 1. Dipartimento di Matematica, Università di Bologna, Piazza di Porta S. Donato 5, 40127 Bologna, Italy.
متن کاملPi-Calculus: A Unifying Framework for Programming Paradigms
π-calculus is a calculus for modeling dynamically changing configurations of a network of communicating agents. This paper studies the suitability of π-calculus as a unifying framework to model the operational semantics of the three paradigms of programming: functional, logic and imperative paradigms. In doing so, the attempt is to demonstrate that π-calculus models a primitive that is pervasiv...
متن کاملMPA: a Stochastic Process Algebra
Process algebras constitute one of the main tools for modeling and analyzing concurrent systems. Unfortunately, with classical process algebras only the functional aspect of the behavior of concurrent systems can be modeled and analyzed. Since the relevance of integrating the performance modeling and evaluation into the process of specification, design and implementation of concurrent systems h...
متن کاملOracle Semantics for Concurrent Separation Logic
We define (with machine-checked proofs in Coq) a modular operational semantics for Concurrent C minor—a language with shared memory, spawnable threads, and first-class locks. By modular we mean that one can reason about sequential control and data-flow knowing almost nothing about concurrency, and one can reason about concurrency knowing almost nothing about sequential control and data-flow con...
متن کاملcmUML - A UML based Framework for Formal Specification of Concurrent, Reactive Systems
Complex software systems possess concurrent and reactive behaviors requiring precise specifications prior to development. Lamport’s transition axiom method is a formal specification method which combines axiomatic and operational approaches. On the other hand Unified Modeling Language (UML), a de facto industry standard visual language, lacks suitable constructs and semantics regarding concurre...
متن کامل